In the problems of minimax tree search , what we are looking for is often the optimal branch at the root node 在极大极小树搜索时,我们经常寻找的是根节点的最优分支。
This makes prbfm a promising emerging game - tree search algorithm in future chip multiprocessor platforms 这使得prbfm成为将来多核处理器( cmp )多线程游戏树搜索benchmark的一个有力的备选算法。
Conduct a tree search . ask people to find large , unusual or historic trees in your community . tell people to take care of them 组织一次寻找珍贵树木的活动,让人们发现社区内的参天大树、罕见的树或者具有历史意义的树木,号召人们保护好这些树。
This thesis discloses some key workload characteristics of tree search applications in some sense , while gives some data support to design intel platform ’ s chip multprocessor 本文在一定程度上揭示了并行树搜索程序在smp平台上的关键负载特征,为intel平台设计多核处理器提供了一些数据支持。
Game - tree search plays an important role in the field of artificial intelligence . in this paper we characterize and compare two parallel game - tree search workloads in chess on two intel xeon 游戏树搜索( game - treesearch )一直以来在人工智能领域扮演着极其重要的角色,并行游戏树搜索更是该领域的热点研究问题。